An Ant Colony Optimization Approa h to Dynami TSP

An Ant Colony Optimization Approa hto the

Studies on the Dynami s of Ant Colony Optimization Algorithms

A CONSTRAINED SOLID TSP IN FUZZY ENVIRONMENT: TWO HEURISTIC APPROACHES

A solid travelling salesman problem (STSP) is a travelling salesman problem (TSP) where the salesman visits all the cities only once in his tour using dierent conveyances to travel from one city to another. Costs and environmental eect factors for travelling between the cities using dierent conveyances are dierent. Goal of the problem is to nd a complete tour with minimum cost that damages the ...

A Hybrid Modified Meta-heuristic Algorithm for Solving the Traveling Salesman Problem

The traveling salesman problem (TSP) is one of the most important combinational optimization problems that have nowadays received much attention because of its practical applications in industrial and service problems. In this paper, a hybrid two-phase meta-heuristic algorithm called MACSGA used for solving the TSP is presented. At the first stage, the TSP is solved by the modified ant colony s...

Parallel Implementation of Ant Colony Optimization for Travelling Salesman Problem

A parallel ant colony algorithm for the Travelling Salesman Problem (TSP) is presented. Some experiments using a MPI based framework are made and analyzed. The achieved results prove that the TSP parallel implementation is efficient. Key-Words: Travelling Salesman Problem, Ant Colony Optimization, Parallel Algorithms, Framework, Message Passing Interface.